Evolving Optimally Reliable Networks by Adding an Edge

نویسنده

  • Tony White
چکیده

Telecommunication networks of known reliability are frequently upgraded as traffic patterns change. In this paper we will present theorems and an algorithm which could be used to solve the problem of adding a single link of known failure probability to a network such that the marginal increase in 2-terminal reliability is maximized. The theorems presented will subsequently be used to derive upper bounds on the 2-terminal reliability of networks with varying numbers of links. A closed form solution for the maximum possible increase in 2-terminal reliability is presented, both for the case of adding a single edge and in the more general nedge problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge-tenacity in Networks

Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...

متن کامل

Using an Evaluator Fixed Structure Learning Automata in Sampling of Social Networks

Social networks are streaming, diverse and include a wide range of edges so that continuously evolves over time and formed by the activities among users (such as tweets, emails, etc.), where each activity among its users, adds an edge to the network graph. Despite their popularities, the dynamicity and large size of most social networks make it difficult or impossible to study the entire networ...

متن کامل

Evolving fuzzy optimally pruned extreme learning machine for regression problems

This paper proposes an approach to the identification of evolving fuzzy Takagi–Sugeno systems based on the optimally pruned extreme learning machine (OP-ELM) methodology. First, we describe ELM, a simple yet accurate learning algorithm for training single-hidden layer feed-forward artificial neural networks with random hidden neurons. We then describe the OP-ELM methodology for building ELM mod...

متن کامل

Surrogate-assisted analysis of weighted functional brain networks.

Graph-theoretical analyses of complex brain networks is a rapidly evolving field with a strong impact for neuroscientific and related clinical research. Due to a number of confounding variables, however, a reliable and meaningful characterization of particularly functional brain networks is a major challenge. Addressing this problem, we present an analysis approach for weighted networks that ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002